Drawing Subway Maps: A Survey

Drawing Maps with Advice

We study the problem of the amount of information required to draw a complete or a partial map of a graph with unlabeled nodes and arbitrarily labeled ports. A mobile agent, starting at any node of an unknown connected graph and walking in it, has to accomplish one of the following tasks: draw a complete map of the graph, i.e., find an isomorphic copy of it including port numbering, or draw a p...

A Survey of Invertibility and Spectrum Preserving Linear Maps

Spectral Graph Drawing: A Survey

We give an overview of graph drawing techniques as discussed by Godsil/Royle, Koren and Pisanski/Shawe-Taylor. These techniques employ the eigenvectors of the Laplacian matrix to create an n-dimensional representation of an undirected graph.

GMap: Drawing Graphs as Maps

Abstract. Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these traditional methods often do not capture well the underlying structural information, clustering, and neighborhoods. In this paper, we describe GMap: a prac...

Automated Drawing of Metro Maps

This diploma thesis investigates the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g. the physical location of the tracks and stations of a metro system) and a set L of paths or cycles in G (e.g. metro lines) such that each edge of G belongs to at least one element of L, draw G and L nicely. We fi...